排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
It is proved in this paper that if G is a simple connected r-uniform hypergraph with G ≥ 2, then G has an edge e such that G-e-V1(e) is also a simple connected r-uniform hypergraph. This reduction is naturally called a combined Graham reduction. Under the simple reductions of single edge removals and single edge contractions, the minor minimal connected simple r-uniform hypergraphs are also determined. 相似文献
1